Parallel Computation of Spectral Portraits on the Meiko CS2

نویسندگان

  • Valérie Frayssé
  • Luc Giraud
  • Vincent Toumazou
چکیده

We describe a parallel software tool intended for the quantiication of the sensitivity of eigenvalues to matrix perturbations of varying size: the spectral portrait shows a representation of the normwise "-pseudospectra of a matrix A. This requires to compute k(A ? zI) ?1 k 2 for all z in a discretized region of the complex plane. The method used for computing k(A ? zI) ?1 k 2 has to be reliable and optimized in terms of both the computation time and the storage requirements in order to treat large sparse matrices. The main features of the code are described. Diierent parallel computation strategies are compared in terms of speed-up. We will show an application on the analysis of an iterative scheme used for the solution of an electro-magnetism problem.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

One Step Closer towards a Realistic Model for Parallel Computation

We present a new model of parallel computation|the LogGP model|and use it to analyze a number of algorithms, most notably, the single node scatter (one-to-all personalized broadcast). The LogGP model is an extension of the LogP model for parallel computation CKP + 93] which abstracts the communication of xed-sized short messages through the use of four parameters: the communication latency (L),...

متن کامل

Tulip: A Portable Run-Time System for Object-Parallel Systems1

This paper describes Tulip, a parallel run-time system used by the pC++ parallel programming language. Tulip has been implemented on a variety of scalable, MPP computers including the IBM SP2, Intel Paragon, HP/Convex SPP, Meiko CS2, SGI Power Challenge, and Cray T3D. Tulip differs from other data-parallel RTS implementations; it is designed to support the operations from object-parallel progra...

متن کامل

Parallel computation framework for optimizing trailer routes in bulk transportation

We consider a rich tanker trailer routing problem with stochastic transit times for chemicals and liquid bulk orders. A typical route of the tanker trailer comprises of sourcing a cleaned and prepped trailer from a pre-wash location, pickup and delivery of chemical orders, cleaning the tanker trailer at a post-wash location after order delivery and prepping for the next order. Unlike traditiona...

متن کامل

A Distributed Shared Memory System Oriented to Volume Visualisation

In this paper we propose the use of the Distributed Shared Memory (DSM) paradigm for parallel volume visualisation. The goal is to offer a comprehensive and portable programming model that exploits the parallelism and data coherency commonly found in volume visualisation. Our approach is based on the development of a library layer that offers a simple and straightforward programming interface. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996